The stable fixtures problem—A many-to-many extension of stable roommates
نویسندگان
چکیده
منابع مشابه
Stable Roommates Spanner
We introduce a new geometric spanner whose construction is based on a generalization of the known Stable Roommates problem. The Stable Roommates Spanner combines the most desirable properties of geometric spanners: a natural definition, small degree, linear number of edges, strong (1 + ε)-spanner for every > 0, and an efficient construction algorithm. It is an improvement over the well-known Ya...
متن کاملThe Strongly Stable Roommates Problem
An instance of the strongly stable roommates problem with incomplete lists and ties (srti) is an undirected non-bipartite graph G = (V,E), with an adjacency list being a linearly ordered list of ties, which are vertices equally good for a given vertex. Ties are disjoint and may contain one vertex. A matching M is a set of vertex-disjoint edges. An edge {x, y} ∈ E \M is a blocking edge for M if ...
متن کاملAn algorithm to compute the full set of many-to-many stable matchings
The paper proposes an algorithm to compute the full set of many-to-many stable matchings when agents have substitutable preferences. The algorithm starts by calculating the two optimal stable matchings using the deferred-acceptance algorithm. Then, it computes each remaining stable matching as the firm-optimal stable matching corresponding to a new preference profile which is obtained after mod...
متن کاملGeometric stable roommates
We consider instances of the Stable Roommates problem that arise from geometric representation of participants preferences: a participant is a point in a metric space, and his preference list is given by sorted distances to the other participants. We observe that, unlike in the general case, if there are no ties in the preference lists, there always exists a unique stable matching; a simple gre...
متن کاملStable roommates and geometric spanners
In this paper we devise a new geometric spanner based on a generalization of the known Stable Roommates algorithm. This spanner is on the “path” between the Yao graph and Yao-Yao graph, and as such it can be computed in a distributed manner and has a bounded degree as the Yao-Yao graph, while on the other hand, it has the same stretch factor bound as the Yao graph.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2007
ISSN: 0166-218X
DOI: 10.1016/j.dam.2007.05.015